Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks

نویسندگان

  • Ian Stewart
  • Martin Golubitsky
  • Marcus Pivato
چکیده

A coupled cell system is a network of dynamical systems, or ‘cells’, coupled together. Such systems can be represented schematically by a directed graph whose nodes correspond to cells and whose edges represent couplings. A symmetry of a coupled cell system is a permutation of the cells that preserves all internal dynamics and all couplings. Symmetry can lead to patterns of synchronized cells, rotating waves, multirhythms, and synchronized chaos. We ask whether symmetry is the only mechanism that can create such states in a coupled cell system, and show that it is not. The key idea is to replace the symmetry group by the symmetry groupoid, which encodes information about the input sets of cells. (The input set of a cell consists of that cell and all cells connected to that cell.) The admissible vector fields for a given graph — the dynamical systems with the corresponding internal dynamics and couplings — are precisely those that are equivariant under the symmetry groupoid. A pattern of synchrony is ‘robust’ if it arises for all admissible vector fields. The first main result shows that robust patterns of synchrony (invariance of ‘polydiagonal’ subspaces under all admissible vector fields) is equivalent to the combinatorial condition that an equivalence relation on cells is ‘balanced’. The second main result shows that admissible vector fields restricted to polydiagonal subspaces are themselves admissible vector fields for a new coupled cell network, the ‘quotient network’. The existence of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetry Groupoids in Coupled Cell Networks

In this paper, we review the application of symmetry groupoids in coupled cell networks, which intuitively speaking allows for the modeling of local symmetry and synchrony in directed graphs. We draw directly and heavily from the works of Golubitsky and Stewart (see [5], [11]) while presenting the groupoid-theoretic approach, in addition to providing a few original examples to motivate the theo...

متن کامل

Some Curious Phenomena in Coupled Cell Networks

We discuss several examples of synchronous dynamical phenomena in coupled cell networks that are unexpected from symmetry considerations, but are natural using a theory developed by Stewart, Golubitsky, and Pivato. In particular we demonstrate patterns of synchrony in networks with small numbers of cells and in lattices (and periodic arrays) of cells that cannot readily be explained by conventi...

متن کامل

Computation of Balanced Equivalence Relations and Their Lattice for a Coupled Cell Network

A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in different ways, which can be represented graphically by different symbols, or abstractly by equivalence relations. Various synchronous behaviors, from full s...

متن کامل

Symmetry and Synchrony in Coupled Cell Networks 1: Fixed-Point Spaces

Equivariant dynamical systems possess canonical flow-invariant subspaces, the fixed-point spaces of subgroups of the symmetry group. These subspaces classify possible types of symmetrybreaking. Coupled cell networks, determined by a symmetry groupoid, also possess canonical flow-invariant subspaces, the balanced polydiagonals. These subspaces classify possible types of synchrony-breaking, and c...

متن کامل

Symmetry and Synchrony in Coupled Cell Networks 2: Group Networks

This paper continues the study of patterns of synchrony (equivalently, balanced colorings or flowinvariant subspaces) in symmetric coupled cell networks, and their relation to fixed-point spaces of subgroups of the symmetry group. Let Γ be a permutation group acting on the set of cells. We define the group network GΓ, whose architecture is entirely determined by the group orbits of Γ. We prove ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Applied Dynamical Systems

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2003